Strongly perfect claw?free graphs—A short proof
نویسندگان
چکیده
A graph is strongly perfect if every induced subgraph H of it has a stable set that meets maximal clique H. claw-free no vertex three pairwise nonadjacent neighbors. The characterization graphs are by forbidden subgraphs was conjectured Ravindra in 1990 and proved Wang 2006. Here we give shorter proof this characterization.
منابع مشابه
A short proof that Diff0(M) is perfect
In this note, we follow the strategy of Haller, Rybicki and Teichmann to give a short, self contained, and elementary proof that Diff0(M) is a perfect group, given a theorem of Herman on diffeomorphisms of the circle.
متن کاملA short proof that Diffc(M) is perfect
In this note, we follow the strategy of Haller, Rybicki and Teichmann to give a short, self contained, and elementary proof that Diff0(M) is a perfect group, given a theorem of Herman on diffeomorphisms of the circle.
متن کاملLow dimensional strongly perfect lattices. III: Dual strongly perfect lattices of dimension 14
The extremal 3-modular lattice [±G2(3)]14 with automorphism group C2 × G2(F3) is the unique dual strongly perfect lattice of dimension 14.
متن کاملLow dimensional strongly perfect lattices . II : Dual strongly perfect lattices of dimension 13 and 15
A lattice is called dual strongly perfect if both, the lattice and its dual, are strongly perfect. We show that there are no dual strongly perfect lattices of dimension 13 and 15.
متن کاملTriangle-free strongly circular-perfect graphs
Zhu [15] introduced circular-perfect graphs as a superclass of the well-known perfect graphs and as an important χ-bound class of graphs with the smallest non-trivial χ-binding function χ(G) ≤ ω(G)+1. Perfect graphs have been recently characterized as those graphs without odd holes and odd antiholes as induced subgraphs [4]; in particular, perfect graphs are closed under complementation [7]. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2021
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22659